Convergence Analysis of the Relaxed Proximal Point Algorithm
نویسندگان
چکیده
منابع مشابه
Super-Relaxed (η)-Proximal Point Algorithms, Relaxed (η)-Proximal Point Algorithms, Linear Convergence Analysis, and Nonlinear Variational Inclusions
We glance at recent advances to the general theory of maximal set-valued monotone mappings and their role demonstrated to examine the convex programming and closely related field of nonlinear variational inequalities. We focus mostly on applications of the super-relaxed η proximal point algorithm to the context of solving a class of nonlinear variational inclusion problems, based on the notion ...
متن کاملOn the convergence rate of the over-relaxed proximal point algorithm
This paper is to illustrate that the main result of the paper [R.U. Verma, Generalized overrelaxedproximal algorithmbased onA-maximalmonotonicity framework and applications to inclusion problems, Mathematical and Computer Modelling 49 (2009) 1587–1594] is incorrect. The convergence rate of the over-relaxed proximal point algorithm should be greater than 1. Moreover, the strong convergence and t...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملRelatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
Based on a notion of relatively maximal m -relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing Rockafellar’s theorem 1976 on linear convergence using the proximal point algorithm in a real Hilbert space setting. Convergence analysis, based on this newmodel, is simpler and compact than that of the celebrated technique of R...
متن کاملA relaxed customized proximal point algorithm for separable convex programming
The alternating direction method (ADM) is classical for solving a linearly constrained separable convex programming problem (primal problem), and it is well known that ADM is essentially the application of a concrete form of the proximal point algorithm (PPA) (more precisely, the Douglas-Rachford splitting method) to the corresponding dual problem. This paper shows that an efficient method comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/912846